Covering and Piercing Disks with Two Centers
نویسندگان
چکیده
We give exact and approximation algorithms for two-center problems when the input is a set D of disks in the plane. We first study the problem of finding two smallest congruent disks such that each disk in D intersects one of these two disks. Then we study the problem of covering the set D by two smallest congruent disks.
منابع مشابه
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
Let D be a set of disks of arbitrary radii in the plane, and let P be a set of points. We study the following three problems: (i) Assuming P contains the set of center points of disks in D, find a minimum-cardinality subset P∗ of P (if exists), such that each disk in D is pierced by at least h points of P∗, where h is a given constant. We call this problem minimum h-piercing. (ii) Assuming P is...
متن کاملMaximal covering location-allocation problem with M/M/k queuing system and side constraints
We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...
متن کاملGeometric p-Center Problems with Centers Constrained to Two Lines
We consider the k-center problem, in which the centers are constrained to lie on two axis-parallel lines. Given a set of n weighted points in the plane, which are sorted according to their x-coordinates, we show how to test in O(n logn) time if k piercing points placed on two lines, parallel to the x-axis, can pierce all the disks of different radii centered at the n given points. This leads to...
متن کاملA PTAS for the disk cover problem of geometric objects
We present PTASes for the disk cover problem: given geometric objects and a finite set of disk centers, minimize the total cost for covering those objects with disks under a polynomial cost function on the disks’ radii. We describe the first FPTAS for covering a line segment when the disk centers form a discrete set, and a PTAS for when a set of geometric objects, described by polynomial algebr...
متن کاملCovering the Boundary of a Simple Polygon with Geodesic Unit Disks
We present an O(n log n) time 2-approximation algorithm for computing the number of geodesic unit disks needed to cover the boundary of a simple polygon on n vertices. The running time thus only depends on the number of vertices and not on the number of disks; the disk centers can be computed in additional time proportional to the number of disks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Geom.
دوره 46 شماره
صفحات -
تاریخ انتشار 2011